OPTIMAL PREEMPTIVE ONLINE SCHEDULING TO MINIMIZE lp NORM ON TWO PROCESSORS
نویسندگان
چکیده
We consider an on-line scheduling problem, where jobs arrive one by one to be scheduled on two identical parallel processors with preemption. The objective is to minimize the machine completion time vector with respect to the lp norm. We present a best possible deterministic on-line scheduling algorithm along with a matching lower bound.
منابع مشابه
A Preemptive multimode resource constrained project scheduling model with cash flows
Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...
متن کاملFast algorithms for preemptive scheduling of equal-length jobs on a single and identical processors to minimize the number of late jobs
We consider the preemptive scheduling of n equal-length jobs with release times and due dates with the objective to minimize the number of late jobs on a single and parallel identical processors. Our algorithm for the single-processor version is on-line and runs in time O(n log n). It produces an optimal schedule. Our multiprocessor algorithm is off-line, it has the time complexity of O(n) and ...
متن کاملDeterministic and randomized scheduling problems under the lp norm on two identical machines
Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it ...
متن کاملPreemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the processors has speed 1 and the other has speed s¿1. The objective is to minimize the makespan. A best possible algorithm with competitive ratio of (1+s)=(1+s+s) is proposed for this problem. c © 1998 Elsevier Science B.V. All rights reserved.
متن کاملAsac 2004 On-line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors
In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors with or without preemption. The objective is to minimize makespan. For the preemptive version of the problem, we present a best possible deterministic on-line scheduling algorithm along with a...
متن کامل